The -Version of Binary Search Trees: An Average Case Analysis

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Binary Search Trees: Average and Worst Case Behavior

We discuss several simple strategies for constructing binary search trees. Upper and lower bounds for the average and worst case search time in trees constructed according to these strategies are derived. Furthermore, different implementations are discussed and the results are applied to digital searching.

متن کامل

Profile and Height of Random Binary Search Trees

The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.

متن کامل

An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations

Cuckoo hashing is a hash table data structure introduced in [1], that offers constant worst case search time. As a major contribution of this paper, we analyse modified versions of this algorithm with improved performance. Further, we provide an asymptotic analysis of the search costs of all this variants of cuckoo hashing and compare this results with the well known properties of double hashin...

متن کامل

Smoothed Analysis of Binary Search Trees

Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform distribution is only logarithmic. The exact value is one of the best studied problems in average-case complexity. We investigate what happens in between by analysing the smoothed height of binary search trees: Random...

متن کامل

Probabilistic analysis of the asymmetric digital search trees

In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ISRN Combinatorics

سال: 2013

ISSN: 2090-8911

DOI: 10.1155/2013/450627